package 力扣日常刷题.木22一月.第12天0120;

/**
 * @author 帅小伙
 * @date 2022/1/20
 * @description
 * 可以使用最长公共子序列减
 */
public class Demo30动态规划中等两个字符串的删除操作 {


    public int minDistance(String word1, String word2) {
        int n = word1.length(), m = word2.length();
        int[][] dp = new int[n+1][m+1];

        for (int i = 1; i <= n ; i++) {
            dp[i][0] = i;
        }
        for (int i = 0; i <= m; i++) {
            dp[0][i] = i;
        }

        for (int i = 0; i < n; i++) {
            char c1 = word1.charAt(i);
            for (int j = 0; j < m; j++) {
                char c2 = word2.charAt(j);
                if(c1 == c2) dp[i+1][j+1] = dp[i][j];
                else{
                    dp[i+1][j+1] = Math.min(dp[i+1][j],dp[i][j+1])+1;
                }
            }
        }
        return dp[n][m];
    }

}
